Profile of TEIRESIAS

ثبت نشده
چکیده

Brief Summary TEIRESIAS is a program designed to function as an assistant to a domain expert in the task of building large knowledge bases. TEIRESIAS facilitates the interactive transfer of knowledge from a human expert to the knowledge base of a performance program (MYCIN), in a high level dialog conducted in a restricted subset of natural language. By using this high level dialog, the expert need have no knowledge of programming – all programming is performed by TEIRESIAS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences

MOTIVATION Pattern discovery in protein sequences is often based on multiple sequence alignments (MSA). The procedure can be computationally intensive and often requires manual adjustment, which may be particularly difficult for a set of deviating sequences. In contrast, two algorithms, PRATT2 (http//www.ebi.ac.uk/pratt/) and TEIRESIAS (http://cbcsrv.watson.ibm.com/) are used to directly identi...

متن کامل

An Intrusion-Detection System Based on the Teiresias Pattern- Discovery Algorithm

This paper addresses the problem of creating a pattern table that can be used to model the normal behavior of a given process. The model can be used for intrusiondetection purposes. So far, most of the approaches proposed have been based on fixed-length patterns, although variable-length patterns seem to be more naturally suited to model the normal process behavior. We have developed a novel te...

متن کامل

Pattern Discovery in Named Organization Corpus

This paper presents how to mine formulation rules from a named organization corpus. The TEIRESIAS algorithm, which is widely used in bioinformatics domain, is adopted. The experimental results based on MET2 test bed show that the approach of regarding the morpheme of a keyword as a cluster is the best, the approach of regarding all the keywords as the same cluster is the next, and the approach ...

متن کامل

Algorithms for Motif Search

University of Connecticut 1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.3 Algorithms for Planted Motif Search . . . . . . . . . . . . . . . 1-2 A Probabilistic Analysis • The WINNOWER and SP-STAR Algorithms • Pattern Br...

متن کامل

Yeast two-hybrid junk sequences contain selected linear motifs

Yeast two-hybrid (Y2H) screenings result in identification of many out-of-frame (OOF) clones that code for short (2-100 amino acids) peptides with no sequence homology to known proteins. We hypothesize that these peptides can reveal common short linear motifs (SLiMs) responsible for their selection. We present a new protocol to address this issue, using an existing SLIM detector (TEIRESIAS) as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002